SpaceMAP - Applying Meta-Heuristics to Real World Space Allocation Problems in Academic Institutions

نویسندگان

  • E. K. Burke
  • C. Beyrouthy
  • J. D. Landa Silva
  • B. McCollum
  • P. McMullan
چکیده

Space allocation is an important issue in the university sector [1]. Frequently, the utilisation of the estate is calculated as the product of the frequency of use of individual rooms and the associated occupancy at a particular time. Then, poorly utilised estate results in significant over expenditure on both capital and operational budgets across the sector. The Higher Education Funding Council for England (HEFCE) reported a mean frequency value of 51% across UK institutions and a mean occupancy rate of 52%. This gives a mean utilisation rate of 26.5%. The main reason for this massive inefficiency in use of space is the poor allocation of space within the institutions. Therefore, an automated system that takes into consideration user defined constraints to calculate, through algorithms, the best allocation of activities to rooms would help to improve enormously the efficiency of space utilisation. Here, activities are defined as any event that requires resources to support its delivery. Examples of activities include: staff, lectures, laboratories, research, tutorials, etc. Currently, due to the complexity of the issues involved and the associated intricate constraints, activities are allocated to rooms through manual processes that cannot reflect the most efficient manner of achieving this allocation. We aim to provide an automated system that replaces the manual process with one that is based on achieving the most efficient and effective allocation of activities to spaces, leading to considerable capital and operational cost savings for the institution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

Comparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem

This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...

متن کامل

New Approaches in Meta-heuristics to Schedule Purposeful Inspections of Workshops in Manufacturing Supply Chains

Nowadays, with the growth of technology and the industrialization of societies, work-related accidents, and consequently the threat of human capital and material resources are among the problems of the countries of the world. The most important legal solution in most countries to control occupational accidents and illnesses is to conduct periodic site visits and identify hazardous sites. To the...

متن کامل

Presenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model

Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same ti...

متن کامل

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004